PROSENJIT BOSE and PAT MORIN
نویسنده
چکیده
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination. These algorithms can be extended to yield algorithms for broadcasting and geocasting that do not require packet duplication. A byproduct of our results is a simple distributed protocol for extracting a planar subgraph of a unit graph. We also present simulation results on the performance of our algorithms.
منابع مشابه
AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE∗ PROSENJIT BOSE and PAT MORIN
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant amount of memory beyond that required to store the subdivision. The algorithm is a refinement of a method introduced by de Berg et al (1997), that reduces the worst case running time from O(n2) to O(n logn). We also ...
متن کاملPacking Two Disks into a Polygonal Environment
Prosenjit Bose1, Pat Morin2, and Antoine Vigneron3 1 Carleton University. [email protected] 2 McGill University. [email protected] 3 Hong Kong University of Science and Technology. [email protected] Abstract. We consider the following problem. Given a polygon P , possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are contained i...
متن کاملComputational Geometry: Theory and Applications
Article history: Received 21 January 2006 Received in revised form 1 January 2007 Accepted 2 February 2007 Available online 12 March 2007 Communicated by P.G. Spirakis
متن کاملNew Bounds for Facial Nonrepetitive Colouring
We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and of any planar graph is at most 22.
متن کاملA Generalized Winternitz Theorem
We prove that, for every simple polygon P having k ≥ 1 reflex vertices, there exists a point q ∈ P such that every half-polygon that contains q contains nearly 1/2(k + 1) times the area of P . We also give a family of examples showing that this result is the best possible. Mathematics Subject Classification (2010). 51E99.
متن کامل